<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML>
<HEAD>
   <TITLE>prob016: traffic lights</TITLE>
</HEAD>
<BODY>

<HR><!------------------------------------------------------------------------>
<CENTER>
<H1>
prob016: traffic lights</H1></CENTER>

<CENTER><TABLE>
<TR>
<TD>proposed by&nbsp;</TD>

<TD ALIGN=LEFT><B><A HREF="http://www.cs.york.ac.uk/~tw">Toby Walsh</A></B>
<ADDRESS>
<A HREF="mailto:tw@cs.york.ac.uk">tw@cs.york.ac.uk</A></ADDRESS>
</TD>
</TR>
</TABLE></CENTER>

<HR><!------------------------------------------------------------------------>
<H3>
References</H3>
Walter Hower <A HREF="http://www.cs.unh.edu/ccc/archive/constraints/archive/traffic.html">originally
proposed</A> this as a CSP benchmark in the <A HREF="http://www.cs.unh.edu/ccc/archive/">Constraints
Archive</A>. He claims it has several interesting features: it concerns
higher-ary constraints (not just binary ones), it is a real-world problem,
it is not too complex, and it shows that local pre-processing may have
little or no effect.
<P>Hower, W. Revisiting global constraint satisfaction, <I><A HREF="http://www.elsevier.nl:80/inca/publications/store/5/0/5/6/1/2/">Information
Processing Letters</A></I>, 66 (1998) 41-48.
<BR>&nbsp;
<BR>&nbsp;
<P>
<HR><!------------------------------------------------------------------------>
<UL><A HREF="../../index.html">Back</A> to CSPLib
home page.</UL>

</BODY>
</HTML>
